Understanding Edge Connectivity in the Internet through Core Decomposition
نویسندگان
چکیده
Internet is a complex network composed by several networks: the Autonomous Systems, each one designed to transport information efficiently. Routing protocols aim to find paths between nodes whenever it is possible (i.e., the network is not partitioned), or to find paths verifying specific constraints (e.g., a certain QoS is required). As connectivity is a measure related to both of them (partitions and selected paths) this work provides a formal lower bound to it based on core-decomposition, under certain conditions, and low complexity algorithms to find it. We apply them to analyze maps obtained from the prominent Internet mapping projects, using the LaNet-vi open-source software for its visualization.
منابع مشابه
مقایسه ساختار اراضی مرتعی و میزان تخریب پیوستگی سیمای سرزمین در زیرحوزه‌های آبخیز ایریل، استان اردبیل
The aim of this research was to compare the rangelands structure and landscape degradation in Iril sub-watersheds, Ardabil province. Land use map and the Landscape Fragmentation Tool were used to determine 4 classes of patch, edge, perforated and core through 5, 10, 15 and 20m cell sizes. The landscape metrics of LPI, ED, cohesion, mesh, split, and AI were calculated using Fragstats software. R...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملA note on connectivity and lambda-modified Wiener index
In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Internet Mathematics
دوره 7 شماره
صفحات -
تاریخ انتشار 2011